Stochastic Methods Based onVU-Decomposition Methods for Stochastic Convex Minimax Problems
نویسندگان
چکیده
منابع مشابه
Convergence Analysis of Sampling-Based Decomposition Methods for Risk-Averse Multistage Stochastic Convex Programs
We consider a class of sampling-based decomposition methods to solve risk-averse multistage stochastic convex programs. We prove a formula for the computation of the cuts necessary to build the outer linearizations of the recourse functions. This formula can be used to obtain an efficient implementation of Stochastic Dual Dynamic Programming applied to convex nonlinear problems. We prove the al...
متن کاملDecomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse
Zhao [28] recently showed that the log barrier associated with the recourse function of twostage stochastic linear programs behaves as a strongly self-concordant barrier and forms a self concordant family on the first stage solutions. In this paper we show that the recourse function is also strongly self-concordant and forms a self concordant family for the two-stage stochastic convex quadratic...
متن کاملSelf-concordant Tree and Decomposition Based Interior Point Methods for Stochastic Convex Optimization Problem
We consider barrier problems associated with two and multistage stochastic convex optimization problems. We show that the barrier recourse functions at any stage form a selfconcordant family with respect to the barrier parameter. We also show that the complexity value of the first stage problem increases additively with the number of stages and scenarios. We use these results to propose a proto...
متن کاملRegression methods for stochastic control problems
In this paper we develop several regression algorithms for solving general stochastic optimal control problems via Monte Carlo. This type of algorithms is particulary useful for problems with high-dimensional state space and complex dependence structure of the underlying Markov process with respect to some control. The main idea of the algorithms is to simulate a set of trajectories under some ...
متن کاملStochastic methods for ill-posed problems
This paper is devoted to the numerical analysis of ill-posed problems of evolution equations in Banach spaces using certain classes of stochastic one step methods. The linear stability properties of these methods are studied. Regularisation is given by the choice of the regularisation parameter as = p n ; where n is the stepsize and provides the convergence on smooth initial data. The case of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Problems in Engineering
سال: 2014
ISSN: 1024-123X,1563-5147
DOI: 10.1155/2014/894248